Extensions of the Knuth-Bendix Ordering with LPO-like Properties
نویسنده
چکیده
The Knuth-Bendix ordering is usually preferred over the lexicographic path ordering in successful implementations of resolution and superposition calculi. However, it is incompatible with certain requirements of hierarchic superposition calculi, and it also does not allow non-linear definition equations to be oriented in a natural way. We present two extensions of the Knuth-Bendix ordering that make it possible to overcome these restrictions.
منابع مشابه
An Extension of the Knuth-Bendix Ordering with LPO-Like Properties
The Knuth-Bendix ordering is usually preferred over the lexicographic path ordering in successful implementations of resolution and superposition, but it is incompatible with certain requirements of hierarchic superposition calculi. Moreover, it does not allow non-linear definition equations to be oriented in a natural way. We present an extension of the Knuth-Bendix ordering that makes it poss...
متن کاملThe Existential Theories of Term Algebras with the Knuth-Bendix Orderings are Decidable
We consider term algebras with simpliication orderings (which are mono-tonic, and well-founded). Solving constraints (quantiier-free formulas) in term algebras with this kind of orderings has several important applications like pruning search space in automated deduction and proving termination and connuence of term rewriting systems. Two kinds of ordering are normally used in automated deducti...
متن کاملThe Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to prove the termination of rewriting systems. They are also applied in ordered resolution to prune the search space without compromising refutational completeness. Solving ordering constraints is therefore essential to t...
متن کاملA Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering
We show the decidability of the existential theory of term algebras with any Knuth-Bendix ordering by giving a procedure for solving Knuth-Bendix ordering constraints.
متن کاملA Unified Ordering for Termination Proving
We introduce a reduction order called the weighted path order (WPO) that subsumes many existing reduction orders. WPO compares weights of terms as in the Knuth-Bendix order (KBO), while WPO allows weights to be computed by a wide class of interpretations. We investigate summations, polynomials and maximums for such interpretations. We show that KBO is a restricted case of WPO induced by summati...
متن کامل